Home » Fiche   membre
Fiche   membre Retour à l'annuaire  

Guillaume MUNCH-MACCAGNONI

CHERCHEUR

Chargé de recherche

: Guillaume.Munchatls2n.fr

Page pro : http://guillaume.munch.name

Adresse :

Université de Nantes - faculté des Sciences et Techniques ( FST )
Petit Port
2 Chemin de la Houssinière
BP 92208
44322 Nantes Cedex 3

Batiment 34, étage 2, bureau 211



Publications référencées sur HAL

Conférences internationales avec comité de lecture et actes (COMM_INT)

    • [1] G. Munch-Maccagnoni. Resource polymorphism: proposal for integrating first-class resources into ML. In Higher-order, Typed, Inferred, Strict: ML Family Workshop 2023, septembre 2023, Seattle, états-Unis.
      https://hal.science/hal-04332484v1
    • [3] G. Munch-Maccagnoni. Efficient “out of heap” pointers for multicore OCaml. In OCaml 2022 - OCaml Users and Developers Workshop, septembre 2022, Ljubljana, Slovénie.
      https://inria.hal.science/hal-03910312v1
    • [5] . Miquey, X. Montillet, G. Munch-Maccagnoni. Dependent Type Theory in Polarised Sequent Calculus (abstract). In TYPES 2020 - 26th International Conference on Types for Proofs and Programs, mars 2020, Torino, Italie.
      https://inria.hal.science/hal-02505671v1
    • [8] G. Combette, G. Munch-Maccagnoni. A resource modality for RAII. In LOLA 2018: Workshop on Syntax and Semantics of Low-Level Languages, juillet 2018, Oxford, Royaume-Uni.
      https://inria.hal.science/hal-01806634v1
    • [9] K. Maillard, . Miquey, X. Montillet, G. Munch-Maccagnoni, G. Scherer. A preview of a tutorial on L (polarized μμ-tilde). In HOPE 2018 - 7th ACM SIGPLAN Workshop on Higher-Order Programming with Effects, septembre 2018, St. Louis, états-Unis.
      https://inria.hal.science/hal-01992294v1
    • [10] P. Clairambault, G. Munch-Maccagnoni. Duploid situations in concurrent games. In 12th Workshop on Games for Logic and Programming Languages (GaLoP XII), avril 2017, Uppsala, Suède.
      https://inria.hal.science/hal-01991555v1
    • [11] G. Munch-Maccagnoni. What term assignments can do for focusing. In 4th International Workshop on Structures and Deduction (SD 2017), septembre 2017, Oxford, Royaume-Uni.
      https://inria.hal.science/hal-01991571v1
    • [12] P. Curien, M. Fiore, G. Munch-Maccagnoni. A theory of effects and resources: adjunction models and polarised calculi. In Principles of Programmming Languages, janvier 2016, Saint-Petersbourg, Florida, états-Unis.
      https://hal.science/hal-01256092v1
    • [13] G. Munch-Maccagnoni, G. Scherer. Polarised Intermediate Representation of Lambda Calculus with Sums. In Thirtieth Annual ACM/IEEE Symposium on Logic In Computer Science (LICS 2015), juillet 2015, Kyoto, Japon.
      https://inria.hal.science/hal-01160579v2
    • [14] G. Munch-Maccagnoni. Formulae-as-Types for an Involutive Negation. In Joint meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (CSL-LICS 2014), juillet 2014, Vienna, Autriche.
      https://inria.hal.science/hal-00996742v2
    • [15] G. Munch-Maccagnoni. Models of a Non-Associative Composition. In FOSSACS 2014 - 17th International Conference on Foundations of Software Science and Computation Structures, avril 2014, Grenoble, France.In Anca Muscholl (éds.), . Springer, 2014.
      https://inria.hal.science/hal-00996729v1
    • [16] P. Curien, G. Munch-Maccagnoni. The Duality of Computation under Focus. In 6th IFIP TC 1/WG 2.2 International Conference on Theoretical Computer Science (TCS) / Held as Part of World Computer Congress (WCC), septembre 2010, Brisbane, Australie.In Cristian S. Calude; Vladimiro Sassone (éds.), . Springer, 2010.
      https://inria.hal.science/inria-00491236v2
    • [17] G. Munch-Maccagnoni. Focalisation and Classical Realisability (version with appendices). In 18th EACSL Annual Conference on Computer Science Logic - CSL 09, septembre 2009, Coimbra, Portugal.In Erich Grädel and Reinhard Kahle (éds.), . Springer-Verlag, 2009.
      https://inria.hal.science/inria-00409793v2

Theses et HDR (THESE)

Copyright : LS2N 2017 - Mentions Légales - 
 -